Laura — a service-based coordination language
نویسندگان
چکیده
منابع مشابه
Laura - A Service-Based Coordination Language
Open distributed systems are computing systems that can be characterized by a heterogeneity of involved machine-and network architectures as well as of the data processed. They have to be able to integrate existing applications, to cope with the use of multiple programming-languages, and potentially high dynamics by joining and leaving components. The coordination language Laura is designed to ...
متن کاملLong Term Research Project # 20197 – PageSpace Report D : Laura – A Service - Based Coordination Language
Open distributed systems are computing systems that can be characterized by a heterogeneity of involved machineand network architectures as well as of the data processed. They have to be able to integrate existing applications, to cope with the use of multiple programming-languages, and potentially high dynamics by joining and leaving components. The coordination language Laura is designed to f...
متن کاملEvent-Based Service Coordination
In this paper we tackle the problem of designing and implementing a framework for programming service coordination policies. In particular, we illustrate the design and the prototype implementation of Java Signal Core Layer (JSCL), a coordination middleware for services based on the event notification paradigm. We formally motivate the design choices of the JSCL middleware by exploiting a varia...
متن کاملCommitment - based service coordination Stefan
We present a methodology for composing large-grained services that exhibit temporal uncertainty and complex task dependencies. Our multi-agent approach incorporates temporal and stochastic planning paradigms and commitment-based negotiation to achieve the coordinated provision of services with stochastic outcomes. This is all captured within a service-choreography protocol, by which agents can ...
متن کاملModeling Web Service Interactions Using the Coordination Language Reo
In this paper we propose an approach to derive the formal semantics of WS-BPEL processes compositionally using Reo and constraint automata. We map each WS-BPEL process into a Reo circuit and then construct the corresponding constraint automaton which shows the behavior of the process. The constraint automaton can be used for analyzing the process behavior. Our work covers the core part of the W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1998
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(97)00027-0